#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <iomanip>
#include <set>
#include <map>
#include <cstdio>
#define fill(a, c) memset(a, c, sizeof(a))
#define ldb long double
#define LL long long
#define nextLine() {int c = 0; while((c = getchar()) != 10 && c != EOF);}
#define sqr(a) ((a) * (a))
#define debug(a) cerr << #a << " = " << a << " ";
#define debugl(a) cerr << #a << " = " << a << "\n";
const ldb eps = 1e-9;
const ldb LDINF = 1e70;
const LL LINF = 1ll << 60;
const int INF = 1 << 30;
const ldb pi = fabs(atan2(0.0, -1.0));
using namespace std;

int n;
string s;

void Load()
{
	cin >> n;
	cin >> s;

}


void Solve()                                                                                                          
{
	int i;
	int j;
	vector <int> a(n, 1);
	for (i = 1; i <= n;)
	{
		int cntL = 0, cntR = 0;
		int k = i;
		for (j = i; j < n && (s[j - 1] == 'R' || s[j - 1] == '='); j++)
		{
			cntR += (s[j - 1] == 'R');
		}
		for (; j < n && (s[j - 1] == 'L' || s[j - 1] == '='); j++)
		{
			cntL += (s[j - 1] == 'L');
		}
		a[k - 1] = max(cntL + 1 - cntR, 1);
		if (k > 1)
		{
			a[k - 1] = max(a[k - 1], a[k - 2] + 1);
		}
		for (; k < j; k++)
		{
			if (s[k - 1] == 'R')
				a[k] = a[k - 1] + 1;
			else if (s[k - 1] == '=')
				a[k] = a[k - 1];
			else a[k] = cntL--;
		}
		i = j + 1;
	}
	/*
	vector <int> a(n, 1);
	int res = n;
	for (i = 1; i < n; i++)
	{
		if (s[i - 1] == 'L')
		{
			if (a[i - 1] <= a[i]) a[i - 1]++, res++;
		}
		else if (s[i - 1] == 'R')
		{
			if (a[i - 1] >= a[i]) a[i] = a[i - 1] + 1, res++;
		}
		else if (s[i - 1] == '=')
		{
         	if (a[i - 1] != a[i])
         	{
         		res++;
         		a[i] = a[i - 1];
         	}
        }
	}
	*/
	for (i = 0; i < n; i++) cout << a[i] << " ";

}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("in", "rt", stdin);
	freopen("out", "wt", stdout);
#endif
	Load();
	Solve();
	return 0;
}
